#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
  freopen("kangaroo.in", "r", stdin);
  freopen("kangaroo.out", "w", stdout);
  int n;

  cin >> n;

  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());

  for (int i = 0, j = 1; i < n / 2; i++) {
    for (; j < n; j++) {
      if (a[i] * 2 <= a[j]) {
        break;
      }
    }
    if (j < n) {
      j++;
    } else {
      cout << i << "\n";
      return 0;
    }
  }
  cout << n / 2 << "\n";
  return 0;
}